A novel data caching scheme for multimedia servers”. Simulation Practice and Theory

In this paper, we propose a Bi-directional Fragmental Pipelining (BFP) technique and its variable buffer size data-caching scheme BFPV to reduce the disk I/O bandwidth requirement for multimedia servers. Our mathematical analysis shows that the BFP technique is superior to the traditional unidirectional pipelining technique in terms of memory buffer space requirement. We further demonstrate that the memory buffer management using BFPV is better than that of using the fixed buffer size approach BFPF. We have mathematically proved that BFPV saves more disk I/O bandwidth than BFPF does using the same memory buffer space. Our simulation results have quantitatively confirmed our analysis